建立上下文无关语法树的经验

2011 IEEE 9th International Symposium on Applied Machine Intelligence and Informatics (SAMI) Pub Date : 2011-03-24 DOI:10.1109/SAMI.2011.5738850

L. Kovács, P. Barabas

{"title":"建立上下文无关语法树的经验","authors":"L. Kovács, P. Barabas","doi":"10.1109/SAMI.2011.5738850","DOIUrl":null,"url":null,"abstract":"One of the main research areas in current intelligent systems is the development of natural language interfaces for applications. The processing of sentences is controlled by grammar of the language. From the viewpoint of efficiency, the most widely used grammar in computer linguistics is the CFG (context-free grammar) formalism. The paper provides an overview of the structure of CFG and it presents an algorithm for automatic grammar tree construction.","PeriodicalId":202398,"journal":{"name":"2011 IEEE 9th International Symposium on Applied Machine Intelligence and Informatics (SAMI)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Experiences in building of context-free grammar tree\",\"authors\":\"L. Kovács, P. Barabas\",\"doi\":\"10.1109/SAMI.2011.5738850\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"One of the main research areas in current intelligent systems is the development of natural language interfaces for applications. The processing of sentences is controlled by grammar of the language. From the viewpoint of efficiency, the most widely used grammar in computer linguistics is the CFG (context-free grammar) formalism. The paper provides an overview of the structure of CFG and it presents an algorithm for automatic grammar tree construction.\",\"PeriodicalId\":202398,\"journal\":{\"name\":\"2011 IEEE 9th International Symposium on Applied Machine Intelligence and Informatics (SAMI)\",\"volume\":\"58 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-03-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE 9th International Symposium on Applied Machine Intelligence and Informatics (SAMI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SAMI.2011.5738850\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE 9th International Symposium on Applied Machine Intelligence and Informatics (SAMI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SAMI.2011.5738850","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

当前智能系统的主要研究领域之一是开发应用程序的自然语言接口。句子的处理受语言语法的控制。从效率的角度来看，计算机语言学中使用最广泛的语法是CFG(上下文无关语法)形式主义。本文概述了语法树的结构，提出了一种自动构建语法树的算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Experiences in building of context-free grammar tree

One of the main research areas in current intelligent systems is the development of natural language interfaces for applications. The processing of sentences is controlled by grammar of the language. From the viewpoint of efficiency, the most widely used grammar in computer linguistics is the CFG (context-free grammar) formalism. The paper provides an overview of the structure of CFG and it presents an algorithm for automatic grammar tree construction.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2011 IEEE 9th International Symposium on Applied Machine Intelligence and Informatics (SAMI)

自引率

0.00%

发文量