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...
| Main Authors: | , , |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
London : Hoboken, NJ :
ISTE Ltd. ; John Wiley & Sons, Inc.,
2018.
|
| Series: | Cognitive science and knowledge management series.
Logic, linguistics and computer science set ; v. 1. |
| Subjects: | |
| Online Access: | Connect to the full text of this electronic book |
| Summary: | 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. |
|---|---|
| Physical Description: | 1 online resource |
| Bibliography: | Includes bibliographical references and index. |
| ISBN: | 9781119428589 1119428580 9781119522348 111952234X 9781119522331 1119522331 |