Concordance

Query N06-2038 9 (288.1 per million)

tech,6-1-N06-2038,ak	There are several approaches that model <term> information extraction </term> as a <term> token classification task </term> , using various <term> tagging strategies </term> to combine multiple <term> tokens </term> .	#11742 There are several approaches that modelinformation extraction as a token classification task, using various tagging strategies to combine multiple tokens.
tech,10-1-N06-2038,ak	There are several approaches that model <term> information extraction </term> as a <term> token classification task </term> , using various <term> tagging strategies </term> to combine multiple <term> tokens </term> .	#11746 There are several approaches that model information extraction as atoken classification task, using various tagging strategies to combine multiple tokens.
tech,16-1-N06-2038,ak	There are several approaches that model <term> information extraction </term> as a <term> token classification task </term> , using various <term> tagging strategies </term> to combine multiple <term> tokens </term> .	#11752 There are several approaches that model information extraction as a token classification task, using varioustagging strategies to combine multiple tokens.
other,21-1-N06-2038,ak	There are several approaches that model <term> information extraction </term> as a <term> token classification task </term> , using various <term> tagging strategies </term> to combine multiple <term> tokens </term> .	#11757 There are several approaches that model information extraction as a token classification task, using various tagging strategies to combine multipletokens.
tech,3-2-N06-2038,ak	We describe the <term> tagging strategies </term> that can be found in the literature and evaluate their relative performances .	#11762 We describe thetagging strategies that can be found in the literature and evaluate their relative performances.
tech,5-3-N06-2038,ak	We also introduce a new <term> strategy </term> , called <term> Begin/After tagging </term> or <term> BIA </term> , and show that it is competitive to the best other <term> strategies </term> .	#11782 We also introduce a newstrategy, called Begin/After tagging or BIA, and show that it is competitive to the best other strategies.
tech,8-3-N06-2038,ak	We also introduce a new <term> strategy </term> , called <term> Begin/After tagging </term> or <term> BIA </term> , and show that it is competitive to the best other <term> strategies </term> .	#11785 We also introduce a new strategy, calledBegin/After tagging or BIA, and show that it is competitive to the best other strategies.
tech,11-3-N06-2038,ak	We also introduce a new <term> strategy </term> , called <term> Begin/After tagging </term> or <term> BIA </term> , and show that it is competitive to the best other <term> strategies </term> .	#11788 We also introduce a new strategy, called Begin/After tagging orBIA, and show that it is competitive to the best other strategies.
tech,23-3-N06-2038,ak	We also introduce a new <term> strategy </term> , called <term> Begin/After tagging </term> or <term> BIA </term> , and show that it is competitive to the best other <term> strategies </term> .	#11800 We also introduce a new strategy, called Begin/After tagging or BIA, and show that it is competitive to the best otherstrategies.


	in Help