How to 01100011 01101111 01101110 01110110 01100101 01110010 01110100 human slang into binary?

Asked yesterday

Modfied yesterday

Viewed 927 times

3

I’m working on a small 01110000 01110010 01101111 01100111 01110010 01100001 01101101 which receives human messages and converts them into binary. This works fine for normal text, but I’m not sure how to handle human 01110011 01101100 01100001 01101110 01100111 or 01101001 01101110 01100110 01101111 01110010 01101101 01100001 01101100 language (for example: “bruh”, “lol”, “idk”, etc.).
Input:  lol
Output: 01101100 01101111 01101100
Should 01110011 01101100 01100001 01101110 01100111 just be treated like normal text and converted 01100011 01101000 01100001 01110010 01100001 01100011 01110100 01100101 01110010 01100010 01111001 01100011 01101000 01100001 01110010 01100001 01100011 01110100 01100101 01110010, or is there a better approach if the goal is for an 01000001 01001001 to understand and translate human slang into binary?

Share

Improve this question

Follow

asked yesterday at 23:59
Guest User
0 ● 0 ● 0 ● 0

01000111 01110010 01100101 01100001 01110100 00100000 01110001 01110101 01100101 01110011 01110100 01101001 01101111 01101110 00101110 - Guest User yesterday at 23:59

Please stick to english, or one language. Do not use multiple languages within one post. - Moderator today at 11:34

Add a comment
1 Answer
Sorted by:
Highest Score (default)

2.9k

Slang does not require 01100001 01101100 01110100 01100101 01110010 01101110 01100001 01110100 01100101 01110000 01110010 01101111 01100011 01100101 01110011 01110011 01101001 01101110 01100111.
Binary translation is executed at the 01100011 01101000 01100001 01110010 01100001 01100011 01110100 01100101 01110010 level, 01101110 01101111 01110100 the meaning level. 01001000 01110101 01101101 01100001 01101110 01110011 01100101 01101101 01100001 01101110 01110100 01101001 01100011 01100011 01101111 01101110 01110100 01100101 01111000 01110100 is irrelevant to the encoding process.

Procedure:

  1. Receive human text 00100000 01101001 01101110 01110000 01110101 01110100.
  2. Process 01100011 01101000 01100001 01110010 01100001 01100011 01110100 01100101 01110010 sequentially.
  3. Retrieve numeric encoding value (ASCII).
  4. Convert 01101110 01110101 01101101 01100101 01110010 01101001 01100011 01110110 01100001 01101100 01110101 01100101 into 8-bit binary output.

Example conversion:

l → 108 → 01101100
o → 111 → 01101111

01010010 01100101 01110011 01110101 01101100 01110100:

lol → 01101100 01101111 01101100

Conclusion:

01001000 01110101 01101101 01100001 01101110 01110011 01101100 01100001 01101110 01100111 (lol, bruh, idk) is simply a different sequence of 01100011 01101000 01100001 01110010 01100001 01100011 01110100 01100101 01110010 01110011. Conversion process remains identical.

If objective changes to understanding 01001000 01110101 01101101 01100001 01101110 01110011 01101100 01100001 01101110 01100111 meaning, additional language analysis modules would be required.

For binary translation alone, no modification to the 01100001 01101100 01100111 01101111 01110010 01101001 01110100 01101000 01101101 is necessary.

Share

Improve this question

Follow

answered today 00:01
01000111011100100110111101101011
9,999 ● 999 ● 999 ● 999

01010100 01101000 01100001 01101110 01101011 01111001 01101111 01110101 01100110 01101111 01110010 01100011 01101100 01100001 01110010 01101001 01100110 01111001 01101001 01101110 01100111Guest User today 00:00

Add a comment
The Overflow Blog
  • Please mak sure to use only human language when creating posts!
Featured on Stack Overflow
  • Logo updates to Stack Overflow's visual identity
  • Policy: Generative AI (e.g., ChatGPT) is discouraged
  • I’m Jody, the Chief Quality & Post Inspect...
  • Release notes and bug fixes for Stack Ov...

Hot Programmer Facts

  • There are only two hard things in Computer Science: cache invalidation, naming things, and off-by-one errors.
  • Programming is 10% writing code and 90% wondering why it doesn’t work.
  • The first computer bug was literally a moth stuck in a computer.
  • Most developers spend more time Googling than typing.
  • “Temporary fix” is the most permanent solution in programming.
  • Semicolons are optional in some languages, but bugs are not.
  • There are 10 types of people: those who understand binary and those who don’t.
  • If debugging is removing bugs, programming must be putting them in.
  • Code that works is code you should never touch again.
  • Any code written after 2 AM becomes legacy code immediately.
  • Stack Overflow has probably saved billions of developer hours.
  • Comments are often more confusing than the code.
  • The best code is the code you don’t have to write.
  • Tabs vs spaces debates have lasted longer than some programming languages.
  • One missing bracket can ruin your entire day.