Regular Approximation of Context-Free Grammars for Chinese Language
碩士 === 臺灣大學 === 電機工程學研究所 === 95 === As parsing context-free grammars is time-consuming, converting the original grammars into approximated regular languages can reduce the complexity. Based on the approaches, the so-called recursive transition network (RTN, which is an -NFA) is the most adequate ap...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/90946857305623515968 |