000 06611cam a2200829Ii 4500
005 20250919132322.0
006 m o d
007 cr cnu|||unuuu
008 190918s2018 enk ob 001 0 eng d
015 _aGBB869447
_2bnb
016 7 _a018832260
_2Uk
020 _a9781119428589
_q(electronic bk.)
020 _a1119428580
_q(electronic bk.)
020 _z9781786300966
020 _a9781119522348
020 _a111952234X
020 _a9781119522331
020 _a1119522331
029 1 _aCHVBK
_b516430246
029 1 _aCHNEW
_b001003276
029 1 _aGBVCP
_b1027308015
029 1 _aUKMGB
_b018832260
035 _a(OCoLC)1031706403
035 _a(OCoLC)on1031706403
037 _a9781119522348
_bWiley
039 9 _a201911041218
_bros
_y09-18-2019
_zhafiz
_wUKM UBCM Wiley MARC (363 titles).mrc
_x10
040 _aNST
_beng
_erda
_epn
_cNST
_dNST
_dEBLCP
_dDG1
_dOCLCA
_dOCLCF
_dUAB
_dRECBK
_dUKMGB
049 _aMAIN
050 4 _aP98
072 7 _aLAN
_x009010
_2bisacsh
082 0 4 _a410.285
_223
100 1 _aBonfante, Guillaume,
_eauthor.
245 1 0 _aApplication of graph rewriting to natural language processing /
_cGuillaume Bonfante, Bruno Guillaume, Guy Perrier.
264 1 _aLondon :
_bISTE Ltd. ;
_aHoboken, NJ :
_bJohn Wiley & Sons, Inc.,
_c2018.
300 _a1 online resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
490 1 _aCognitive science series
490 1 _aLogic, linguistics and computer science set ;
_vvolume 1
504 _aIncludes bibliographical references and index.
505 0 _aCover; Half-Title Page; Title Page; Copyright Page; Contents; Introduction; 1. Programming with Graphs; 1.1. Creating a graph; 1.2. Feature structures; 1.3. Information searches; 1.3.1. Access to nodes; 1.3.2. Extracting edges; 1.4. Recreating an order; 1.5. Using patterns with the GREW library; 1.5.1. Pattern syntax; 1.5.2. Common pitfalls; 1.6. Graph rewriting; 1.6.1. Commands; 1.6.2. From rules to strategies; 1.6.3. Using lexicons; 1.6.4. Packages; 1.6.5. Common pitfalls; 2. Dependency Syntax: Surface Structure and Deep Structure; 2.1. Dependencies versus constituents
505 8 _a2.2. Surface syntax: different types of syntactic dependency2.2.1. Lexical word arguments; 2.2.2. Modifiers; 2.2.3. Multiword expressions; 2.2.4. Coordination; 2.2.5. Direction of dependencies between functional and lexical words; 2.3. Deep syntax; 2.3.1. Example; 2.3.2. Subjects of infinitives, participles, coordinated verbs and adjectives; 2.3.3. Neutralization of diatheses; 2.3.4. Abstraction of focus and topicalization procedures; 2.3.5. Deletion of functional words; 2.3.6. Coordination in deep syntax; 3. Graph Rewriting and Transformation of Syntactic Annotations in a Corpus
505 8 _a3.1. Pattern matching in syntactically annotated corpora3.1.1. Corpus correction; 3.1.2. Searching for linguistic examples in a corpus; 3.2. From surface syntax to deep syntax; 3.2.1. Main steps in the SSQ_to_DSQ transformation; 3.2.2. Lessons in good practice; 3.2.3. The UD_to_AUD transformation system; 3.2.4. Evaluation of the SSQ_to_DSQ and UD_to_AUD systems; 3.3. Conversion between surface syntax formats; 3.3.1. Differences between the SSQ and UD annotation schemes; 3.3.2. The SSQ to UD format conversion system; 3.3.3. The UD to SSQ format conversion system
505 8 _a4. From Logic to Graphs for Semantic Representation4.1. First order logic; 4.1.1. Propositional logic; 4.1.2. Formula syntax in FOL; 4.1.3. Formula semantics in FOL; 4.2. Abstract meaning representation (AMR); 4.2.1. General overview of AMR; 4.2.2. Examples of phenomena modeled using AMR; 4.3. Minimal recursion semantics, MRS; 4.3.1. Relations between quantifier scopes; 4.3.2. Why use an underspecified semantic representation?; 4.3.3. The RMRS formalism; 4.3.4. Examples of phenomenon modeling in MRS; 4.3.5. From RMRS to DMRS
505 8 _a5. Application of Graph Rewriting to Semantic Annotation in a Corpus5.1. Main stages in the transformation process; 5.1.1. Uniformization of deep syntax; 5.1.2. Determination of nodes in the semantic graph; 5.1.3. Central arguments of predicates; 5.1.4. Non-core arguments of predicates; 5.1.5. Final cleaning; 5.2. Limitations of the current system; 5.3. Lessons in good practice; 5.3.1. Decomposing packages; 5.3.2. Ordering packages; 5.4. The DSQ_to_DMRS conversion system; 5.4.1. Modifiers; 5.4.2. Determiners; 6. Parsing Using Graph Rewriting; 6.1. The Cocke-Kasami-Younger parsing strategy
520 _aThe 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.
588 0 _aOnline resource; title from PDF title page (EBSCO, viewed April 20, 2018).
650 0 _aComputational linguistics.
650 0 _aRewriting systems (Computer science)
650 0 _aGraph theory
_xData processing.
650 0 _aLanguage and logic.
650 7 _aLANGUAGE ARTS & DISCIPLINES / Linguistics / Historical & Comparative.
_2bisacsh
650 7 _aComputational linguistics.
_2fast
_0(OCoLC)fst00871998
650 7 _aGraph theory
_xData processing.
_2fast
_0(OCoLC)fst00946587
650 7 _aLanguage and logic.
_2fast
_0(OCoLC)fst00992279
650 7 _aRewriting systems (Computer science)
_2fast
_0(OCoLC)fst01096809
655 4 _aElectronic books.
700 1 _aGuillaume, Bruno,
_eauthor.
700 1 _aPerrier, Guy,
_d1950-
_eauthor.
773 0 _tWiley e-books
776 0 8 _iPrint version :
_z9781786300966
830 0 _aCognitive science and knowledge management series.
830 0 _aLogic, linguistics and computer science set ;
_vv. 1.
856 4 0 _uhttps://eresourcesptsl.ukm.remotexs.co/user/login?url=https://doi.org/10.1002/9781119428589
_zWiley Online Library
907 _a.b16755030
_b2022-11-08
_c2019-11-12
942 _n0
914 _avtls003651160
998 _ae
_b2019-05-09
_cm
_dz
_feng
_genk
_y0
_z.b16755030
999 _c643390
_d643390