Application of graph rewriting to natural language processing
The paradigm of Graph Rewriting is used very little in the field of Natural Language Processing. But graphs are a natural way of representing the deep syntax and the semantics of natural languages. Deep syntax is an abstraction of syntactic dependencies towards semantics in the form of graphs and th...
| Otros Autores: | , , |
|---|---|
| Formato: | Libro electrónico |
| Idioma: | Inglés |
| Publicado: |
London : Hoboken, NJ :
ISTE Ltd. ; John Wiley & Sons, Inc
2018.
|
| Colección: | Wiley ebooks.
Cognitive science series. Logic, linguistics and computer science set ; 1. |
| Acceso en línea: | Conectar con la versión electrónica |
| Ver en Universidad de Navarra: | https://innopac.unav.es/record=b40631953*spi |
| Sumario: | The paradigm of Graph Rewriting is used very little in the field of Natural Language Processing. But graphs are a natural way of representing the deep syntax and the semantics of natural languages. Deep syntax is an abstraction of syntactic dependencies towards semantics in the form of graphs and there is a compact way of representing the semantics in an underspecified logical framework also with graphs. Then, Graph Rewriting reconciles efficiency with linguistic readability for producing representations at some linguistic level by transformation of a neighbor level: from raw text to surface syntax, from surface syntax to deep syntax, from deep syntax to underspecified logical semantics and conversely. |
|---|---|
| Descripción Física: | 1 recurso electrónico |
| Formato: | Forma de acceso: World Wide Web. |
| Bibliografía: | Incluye referencias bibliográficas e índice. |
| ISBN: | 9781119428589 9781119522348 9781119522331 |
