Carregant...
Fast approximate string matching with finite automata
We present a fast algorithm for finding approximate matches of a string in a finite-state automaton, given some metric of similarity. The algorithm can be adapted to use a variety of metrics for determining the distance between two words.
Guardat en:
| Publicat a: | Procesamiento del Lenguaje Natural |
|---|---|
| Autor principal: | |
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
Sociedad Española para el Procesamiento del Lenguaje Natural
2009
|
| Matèries: | |
| Accés en línia: | https://www.redalyc.org/articulo.oa?id=515751743007 |
| Etiquetes: |
Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|