Algorithm for word segmentation based on the shortest path algorithm inside a graph
The features of word segmentation algorithms from such texts are considered. There are two main models, namely, statistical one and the one using a dictionary. For models with a dictionary, a variant of the maximal matching algorithm is noted for which there are modifications such as Forward Maximal...
Saved in:
| Date: | 2017 |
|---|---|
| Main Authors: | , , |
| Format: | Article |
| Language: | rus |
| Published: |
Інститут проблем реєстрації інформації НАН України
2017
|
| Subjects: | |
| Online Access: | http://drsp.ipri.kiev.ua/article/view/142917 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Data Recording, Storage & Processing |