{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T15:16:51Z","timestamp":1771600611206,"version":"3.50.1"},"reference-count":11,"publisher":"MIT Press - Journals","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Linguistics"],"published-print":{"date-parts":[[2000,3]]},"abstract":"<jats:p> Several methods are discussed that construct a finite automaton given a context-free grammar, including both methods that lead to subsets and those that lead to supersets of the original context-free language. Some of these methods of regular approximation are new, and some others are presented here in a more refined form with respect to existing literature. Practical experiments with the different methods of regular approximation are performed for spoken-language input: hypotheses from a speech recognizer are filtered through a finite automaton. <\/jats:p>","DOI":"10.1162\/089120100561610","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T11:56:30Z","timestamp":1027770990000},"page":"17-44","source":"Crossref","is-referenced-by-count":37,"title":["Practical Experiments with Regular Approximation of Context-Free Languages"],"prefix":"10.1162","volume":"26","author":[{"given":"Mark-Jan","family":"Nederhof","sequence":"first","affiliation":[{"name":"German Research Center for Artificial Intelligence, DFKI, Stuhlsatzenhausweg 3, D-66123 Saarbr\u00fccken, Germany."}]}],"member":"281","reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(81)90030-1"},{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(90)90037-L"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(59)80017-6"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(59)90362-6"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(73)80050-9"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1145\/362007.362035"},{"key":"p_13","doi-asserted-by":"publisher","DOI":"10.1515\/thli.1981.8.1-3.173"},{"key":"p_22","doi-asserted-by":"publisher","DOI":"10.1080\/01690968608407061"},{"key":"p_23","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288959"},{"key":"p_26","doi-asserted-by":"publisher","DOI":"10.1080\/00207169508804370"},{"key":"p_28","doi-asserted-by":"publisher","DOI":"10.1145\/355598.362773"}],"updated-by":[{"DOI":"10.1162\/089120100561782","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000}}],"container-title":["Computational Linguistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mitpressjournals.org\/doi\/pdf\/10.1162\/089120100561610","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,12]],"date-time":"2021-03-12T21:41:38Z","timestamp":1615585298000},"score":1,"resource":{"primary":{"URL":"https:\/\/direct.mit.edu\/coli\/article\/26\/1\/17-44\/1634"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,3]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,3]]}},"alternative-id":["10.1162\/089120100561610"],"URL":"https:\/\/doi.org\/10.1162\/089120100561610","relation":{},"ISSN":["0891-2017","1530-9312"],"issn-type":[{"value":"0891-2017","type":"print"},{"value":"1530-9312","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,3]]}}}