Efficient finite-state algorithms for the application of local grammars
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10045/23296
| Title: | Efficient finite-state algorithms for the application of local grammars |
|---|---|
| Other Titles: | Algorithmes performants à états finis pour l'application de grammaires locales | Algoritmos eficientes de estados finitos para la aplicación de gramáticas locales |
| Authors: | Sastre Martínez, Javier Miguel |
| Research Director: | Forcada Zubizarreta, Mikel L. | Laporte, Éric |
| Center, Department or Service: | Universidad de Alicante. Departamento de Lenguajes y Sistemas Informáticos |
| Keywords: | Natural language | Local grammar | Finite state hierarchy | Finite state machine | Earley | Parser | Recursive transition network | Filtered popping | Blackboard set processing | MovistarBot |
| Knowledge Area: | Lenguajes y Sistemas Informáticos |
| Date Created: | 2011 |
| Issue Date: | 2011 |
| Date of defense: | 16-Jul-2011 |
| Publisher: | Universidad de Alicante |
| URI: | http://hdl.handle.net/10045/23296 |
| ISBN: | 978-84-695-3234-8 |
| Language: | eng |
| Type: | info:eu-repo/semantics/doctoralThesis |
| Appears in Collections: | Doctoral theses |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
 tesisjaviemiguelsastre.pdf | 3,42 MB | Adobe PDF | Open Preview | |
See citations in Google Scholar
This item is licensed under a Creative Commons License
