{"title":"基于延迟求值的语义树手印文档的广义上下文识别","authors":"L. Du, A. Downton, S. Lucas, Badr Al-Badr","doi":"10.1109/ICDAR.1997.619848","DOIUrl":null,"url":null,"abstract":"Describes a new general-purpose contextual architecture which provides a unified framework for efficiently combining all types and levels of context in hand-print recognition applications. The architecture has been designed and built as a C++ class library and utilised within an initial demonstrator which implements full contextual constraints for a combination of postcode and corresponding postal address. Preliminary evaluation of the demonstrator suggests the system has the potential to achieve genuinely remarkable performance compared with previous context systems: its memory requirements are an order of magnitude less than an equivalent trie-based dictionary; its search speed is at least an order of magnitude faster than the trie, and actually gets faster as the dictionary size increases(!); and its error rate is virtually zero if suitable contextual constraints can be applied. Using this architecture, it appears to be possible to build real-time solutions to large-scale heterogeneous contextual problems.","PeriodicalId":435320,"journal":{"name":"Proceedings of the Fourth International Conference on Document Analysis and Recognition","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Generalized contextual recognition of hand-printed documents using semantic trees with lazy evaluation\",\"authors\":\"L. Du, A. Downton, S. Lucas, Badr Al-Badr\",\"doi\":\"10.1109/ICDAR.1997.619848\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Describes a new general-purpose contextual architecture which provides a unified framework for efficiently combining all types and levels of context in hand-print recognition applications. The architecture has been designed and built as a C++ class library and utilised within an initial demonstrator which implements full contextual constraints for a combination of postcode and corresponding postal address. Preliminary evaluation of the demonstrator suggests the system has the potential to achieve genuinely remarkable performance compared with previous context systems: its memory requirements are an order of magnitude less than an equivalent trie-based dictionary; its search speed is at least an order of magnitude faster than the trie, and actually gets faster as the dictionary size increases(!); and its error rate is virtually zero if suitable contextual constraints can be applied. Using this architecture, it appears to be possible to build real-time solutions to large-scale heterogeneous contextual problems.\",\"PeriodicalId\":435320,\"journal\":{\"name\":\"Proceedings of the Fourth International Conference on Document Analysis and Recognition\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-08-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Fourth International Conference on Document Analysis and Recognition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDAR.1997.619848\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Fourth International Conference on Document Analysis and Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDAR.1997.619848","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Generalized contextual recognition of hand-printed documents using semantic trees with lazy evaluation
Describes a new general-purpose contextual architecture which provides a unified framework for efficiently combining all types and levels of context in hand-print recognition applications. The architecture has been designed and built as a C++ class library and utilised within an initial demonstrator which implements full contextual constraints for a combination of postcode and corresponding postal address. Preliminary evaluation of the demonstrator suggests the system has the potential to achieve genuinely remarkable performance compared with previous context systems: its memory requirements are an order of magnitude less than an equivalent trie-based dictionary; its search speed is at least an order of magnitude faster than the trie, and actually gets faster as the dictionary size increases(!); and its error rate is virtually zero if suitable contextual constraints can be applied. Using this architecture, it appears to be possible to build real-time solutions to large-scale heterogeneous contextual problems.