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...
Gespeichert in:
| Datum: | 2017 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | rus |
| Veröffentlicht: |
Інститут проблем реєстрації інформації НАН України
2017
|
| Schlagworte: | |
| Online Zugang: | http://drsp.ipri.kiev.ua/article/view/142917 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Назва журналу: | Data Recording, Storage & Processing |