Algorithm for word segmentation based on the shortest path algorithm inside a graph
Saved in:
| Date: | 2017 |
|---|---|
| Main Authors: | D. V. Lande, B. A. Berezin, Ju. Pavlenko |
| Format: | Article |
| Language: | English |
| Published: |
2017
|
| Series: | Data recording, storage & processing |
| Online Access: | http://jnas.nbuv.gov.ua/article/UJRN-0000869762 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Library portal of National Academy of Sciences of Ukraine | LibNAS |
Institution
Library portal of National Academy of Sciences of Ukraine | LibNASSimilar Items
Similar Items
-
Algorithm for word segmentation based on the shortest path algorithm inside a graph
by: Lande, D. V., et al.
Published: (2017) -
Overview of methods and algorithms of constructing the shortest paths and prospects of their development
by: A. N. Trofimchuk, et al.
Published: (2020) -
On the shortest k-node path in a directed graph
by: P. I. Stetsjuk, et al.
Published: (2016) -
A finding Shortest Paths in a Two-level Graph
by: H. V. Bilyk, et al.
Published: (2014) -
Formulations of problems for k-node shortest path and k-node shortest cycle in a complete graph
by: P. I. Stetsjuk
Published: (2016)