{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/code-switched-language-identification-is","title":"Code-Switched Language Identification is Harder Than You Think","arxiv_id":"2402.01505","date":"2024-02-02","proceeding":null,"authors":["Laurie Burchell","Alexandra Birch","Robert P. Thompson","Kenneth Heafield"],"abstract":"Code switching (CS) is a very common phenomenon in written and spoken communication but one that is handled poorly by many natural language processing applications. Looking to the application of building CS corpora, we explore CS language identification (LID) for corpus building. We make the task more realistic by scaling it to more languages and considering models with simpler architectures for faster inference. We also reformulate the task as a sentence-level multi-label tagging problem to make it more tractable. Having defined the task, we investigate three reasonable models for this task and define metrics which better reflect desired performance. We present empirical evidence that no current approach is adequate and finally provide recommendations for future work in this area.","url_abs":"https://arxiv.org/abs/2402.01505v1","url_pdf":"https://arxiv.org/pdf/2402.01505v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"code-switched-language-identification-is","repo_url":"https://github.com/laurieburchell/cs-lid-harder-than-you-think","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"language-identification","task_name":"Language Identification"},{"task_slug":"sentence","task_name":"Sentence"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":"https://app.syntology.ai/?focus=2402.01505","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.01505"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/laurieburchell/cs-lid-harder-than-you-think","reach":null}],"summary":{"ran_fixture":3},"by_repo_kind":{"official":{"samples":3,"ran":3,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"f169511ce1ec7ee5","entry":"calculate_exact_match_ratio","repo":"laurieburchell/cs-lid-harder-than-you-think","repo_kind":"official","path":"metrics/calculate_metrics.py","file_url":"https://github.com/laurieburchell/cs-lid-harder-than-you-think/blob/HEAD/metrics/calculate_metrics.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"f169511ce1ec7ee5"}},{"code_sha256_prefix":"4c475a221026b615","entry":"calculate_false_positive_rate","repo":"laurieburchell/cs-lid-harder-than-you-think","repo_kind":"official","path":"metrics/calculate_metrics.py","file_url":"https://github.com/laurieburchell/cs-lid-harder-than-you-think/blob/HEAD/metrics/calculate_metrics.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"4c475a221026b615"}},{"code_sha256_prefix":"fb9df3c9672be226","entry":"calculate_hamming_loss","repo":"laurieburchell/cs-lid-harder-than-you-think","repo_kind":"official","path":"metrics/calculate_metrics.py","file_url":"https://github.com/laurieburchell/cs-lid-harder-than-you-think/blob/HEAD/metrics/calculate_metrics.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"fb9df3c9672be226"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}